Arithmetic progressions with a pseudorandom step
نویسندگان
چکیده
Let α, σ > 0 and let A and S be subsets of a finite abelian group G of densities α and σ independent of |G|, respectively. Without additional restrictions A need not contain a 3-term arithmetic progression whose common gap is in S. What is then the least integer k ≥ 2 for which there exists an η = η(α, σ) such that ‖S‖Uk(G) ≤ η implies that A contains a non-trivial 3-term arithmetic progression with a common gap in S? For G = Zn (n sufficiently large and odd) we show that k = 3, while for G = Fp (p an odd prime and n sufficiently large) we show that k = 2.
منابع مشابه
The Primes Contain Arbitrarily Long Arithmetic Progressions
We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemerédi’s theorem, which asserts that any subset of the integers of positive density contains progressions of arbitrary length. The second, which is the main new ingredient of this paper, is a certain transference principle. This allows us to deduce from Szemerédi’s theo...
متن کاملThe primes contain arbitrarily long arithmetic progressions
We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemerédi’s theorem, which asserts that any subset of the integers of positive density contains progressions of arbitrary length. The second, which is the main new ingredient of this paper, is a certain transference principle. This allows us to deduce from Szemerédi’s theo...
متن کاملA Relative Szemerédi Theorem
Abstract: The celebrated Green-Tao theorem states that there are arbitrarily long arithmetic progressions in the primes. The proof has two parts. The first part is a relative Szemerédi theorem which says that any subset of a pseudorandom set of integers of positive relative density contains long arithmetic progressions, where a set is pseudorandom if it satisfies two conditions, the linear form...
متن کاملPrimes in Arbitrarily Long Arithmetic Progression
It has been a long conjecture that there are arbitrarily long arithmetic progressions of primes. As of now, the longest known progression of primes is of length 26 and was discovered by Benoat Perichon and PrimeGrid in April, 2010 ([1]): 43142746595714191+23681770·223092870n for n = 0, 1, · · · , 25. Many mathematicians have spent years trying to prove (or disprove) this conjecture, and even mo...
متن کاملOn rainbow 4-term arithmetic progressions
{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 49 شماره
صفحات -
تاریخ انتشار 2015